碳纤维混凝土抗冻性能试验研究

为了增强高昼夜温差地区营房屋面和墙体的抗裂性能,提高营房安全性、舒适性及使用寿命,利用快速冻融法对碳纤维混凝土进行了300次冻融循环试验,并测量其相对动弹性模量和质量损失情况。结果显示:普通混凝土在150次冻融循环试验后试件破坏严重,平均质量损失了0.695 kg,损失率为6.9%;碳纤维混凝土在300次冻融循环试验后外形仍保持较好的完整性,平均质量损失了0.514 kg,损失率为5.19%,相对动弹性模量最多下降了34%,其中体积分数为1%的碳纤维混凝土平均质量损失仅为0.398 kg,损失率为4.05%,相对动弹性模量下降了31%。试验表明碳纤维可以改善混凝土的抗冻性能,适用于高昼夜温差地区建筑。     

基于集对分析的海上油料补给方法选择优化

针对各种复杂环境对海上油料补给方法选择的不确定性影响,在分析海上油料补给方法选择影响因素的基础上,确定了海上油料补给方法选择的属性要素,运用集对分析理论建立了海上油料补给方法选择的优化模型;采用变异系数法计算属性权重,通过构建海上油料补给方法选择的正、负理想方案,确定了各备选方案与理想方案之间的联系度。算例分析结果表明,将集对分析运用于海上油料补给方法的选择,能够有效降低多种复杂因素对油料补给方法选择的不确定性影响。     

求解CVRP问题的一种改进启发式蚁群算法

针对蚁群算法求解CVRP问题时收敛速度慢、求解质量不高的缺点,提出了一种改进启发式蚁群算法。该算法借鉴蚁群系统和基于排列的蚂蚁系统的优点设计信息素更新策略,既加强了对每次迭代最好解的利用,又避免了陷入局部最优;按一定比例使用基本方法和基于PFIH方法构造路径,扩大了算法的搜索空间;采用一种混合局部搜索算子,增强了算法局部寻优能力。实验结果表明,改进启发式蚁群算法可以大幅度减少车辆运行成本,具有较快的收敛速度。     

基于大涡模拟的气体羽流分层特性数值模拟

采用大涡模拟(LES)对气体羽流分层特性进行数值模拟,分析了基于LES的气体羽流模型、控制方程和数值计算方法,探讨了LES在多组分气体羽流模拟中的应用;以文献[1]中氦气在空气中形成羽流的实验数据为参考,对所建模型进行验证。利用该模型对密闭空间油气泄漏过程进行数值模拟,计算结果表明油气在泄漏发生的240 s之内,不同组分表现出显著不同的分层规律:相对于空气,密度较大的组分聚集在空间下部20%的范围内;密度较小的组分主要分散在空间上部80%的范围内。研究结果为油库油气危险源安全监测与预警、火灾预防与扑救等提供了关键参数参考和工程设计理论依据。     

燃烧室-喷管流场数值解

本文用时间相关法计算了固体火箭发动机燃烧室─喷管亚跨声速流场数值解,控制方程用ＭａｃＣｏｒｍａｃｋ二步显格式：边界点参数用物理边界条件和参考平面上的特征方程计算。计算表明,达到收敛的数值积分步数比纯喷管的跨声速计算要多得多。虽然喷管壁上和轴线上的马赫数分布与纯喷管计算类似,但喷管中的等马赫线分布与纯喷管计算的结果［３］相差较远。     

无源时差定位系统的模糊无解问题

本文对平面三站无源时差定位系统的定位过程中可能出现的无解和模糊现象进行了探讨,找出了无解分布与布站以及观测噪声方差大小之间的规律,得出了模糊分布与布站之间的关系,并提供了一些解决方法。     

Stochastic scheduling subject to machine breakdowns: The preemptive‐repeat model with discounted reward and other criteria

We consider the problem of scheduling a set of jobs on a single machine subject to random breakdowns. We focus on the preemptive‐repeat model, which addresses the situation where, if a machine breaks down during the processing of a job, the work done on the job prior to the breakdown is lost and the job will have to be started from the beginning again when the machine resumes its work. We allow that (i) the uptimes and downtimes of the machine follow general probability distributions, (ii) the breakdown process of the machine depends upon the job being processed, (iii) the processing times of the jobs are random variables following arbitrary distributions, and (iv) after a breakdown, the processing time of a job may either remain a same but unknown amount, or be resampled according to its probability distribution. We first derive the optimal policy for a class of problems under the criterion to maximize the expected discounted reward earned from completing all jobs. The result is then applied to further obtain the optimal policies for other due date‐related criteria. We also discuss a method to compute the moments and probability distributions of job completion times by using their Laplace transforms, which can convert a general stochastic scheduling problem to its deterministic equivalent. The weighted squared flowtime problem and the maintenance checkup and repair problem are analyzed as applications. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

车辆馈能悬挂技术综述

被动悬挂的系统参数不能随路面状况变化而改变,故减振性能有限,且振动能量被减振器以热量的形式耗散,造成了能量的浪费。馈能悬挂能够提高悬挂性能并降低能耗,正受到广泛关注。对车辆悬挂的能量耗散和馈能潜力进行了探讨,回顾了馈能悬挂的研究和发展状况,总结了馈能悬挂的结构方案和优缺点。最后,分析了已有馈能悬挂存在的问题和应用受限的根本原因,并指出能够兼顾振动控制效果与能量回收效率的馈能悬挂将会有良好的发展前景。     

基于变异离散粒子群的协同空战攻击决策算法

为了提高智能协同空战攻击决策算法性能,将变异策略引入到DPSO(Discrete Particle Swarm Optimization)协同空战攻击决策算法中,提出了一种新的基于变异离散粒子群(Mutation Discrete Particle Swarm Optimization,MDPSO)的协同空战攻击决策算法。基于典型空战想定背景,仿真验证了算法的有效性。采用对比实验方法,基于准确性、可靠性和快速性等关键性能指标,分析比较了基于MDPSO协同空战攻击决策算法与多种智能决策算法,验证了基于MDPSO的协同空战攻击决策算法有着较好的综合性能。     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010